COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
نویسندگان
چکیده
منابع مشابه
Computing Largest Circles Separating Two Sets of Segments
A circle C separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets. An (n log n) optimal algorithm is proposed to nd all largest circles separating two given sets of line segments when line segments are allowed to meet only at ...
متن کاملComputing Largest Empty Circles with Location Constraints 1 ' 2
Let Q = {qj, qz,..., qn / be a set of n points on the plane. The largest empty circle (LEC) problem consists in finding the largest circle C with center in the convex hull of Q such that no point q(C Q lies in the interior of C. Shamos recently outlined an O(n log n) algorithm for solving this problemJ 9) In this paper it is shown that this algorithm does not always work correctly. A different ...
متن کاملDraft: Eecient Algorithm for Nding Two Largest Empty Circles
This paper considers the problem of nding of 2 largest equal-radius non-overlapping circles in a simple polygon. We present O(n log 3 n) algorithm for nding disks in a polygon with n vertices. It improves recent algorithm of Bield et al. 1] that takes at least (n 2) time.
متن کاملSeparating objects in the plane by wedges and strips
In this paper we study the separability of two disjoint sets of objects in the plane according to two criteria: wedge separability and strip separability. We give algorithms for computing all the separating wedges and strips, the wedges with the maximum and minimum angle, and the narrowest and the widest strip. The objects we consider are points, segments, polygons and circles. As applications,...
متن کاملMinimal Separating Sets for
For a Muller automaton only a subset of its states is needed to decide whether a run is accepting or not: The set I the innnitely often visited states can be replaced by the intersection I \ W with a xed set W of states, provided W is large enough to distinguish between accepting and non-accepting loops in the automaton. We call such a subset W a separating set. Whereas the idea was previously ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2000
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195900000036